INSEAN National Research Center for Ships and Marine Systems INSEAN Technical Report 2008-035/rt A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization: complete results

نویسندگان

  • Giovanni Fasano
  • Stefano Lucidi
  • G. Fasano
  • S. Lucidi
چکیده

We propose a new truncated Newton method for large scale unconstrained optimization, where a Conjugate Gradient (CG)-based technique is adopted to solve Newton’s equation. In the current iteration, the Krylov method computes a pair of search directions: the first approximates the Newton step of the quadratic convex model, while the second is a suitable negative curvature direction. A test based on the quadratic model of the objective function is used to select the most promising between the two search directions. Both the latter selection rule and the CG stopping criterion for approximately solving Newton’s equation, strongly rely on conjugacy conditions. An appropriate linesearch technique is adopted for each search direction: a nonmonotone stabilization is used with the approximate Newton step, while an Armijo type linesearch is used for the negative curvature direction. We prove both the global and the superlinear convergence to stationary points satisfying second order necessary conditions. We carry out a significant numerical experience in order to test our proposal.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization

We propose a new truncated Newton method for large scale unconstrained optimization, where a Conjugate Gradient (CG)-based technique is adopted to solve Newton’s equation. In the current iteration, the Krylov method computes a pair of search directions: the first approximates the Newton step of the quadratic convex model, while the second is a suitable negative curvature direction. A test based...

متن کامل

A Truncated Newton Method with Nonmonotone Line Search for Unconstrained Optimization

In this paper, an unconstrained minimization algorithm is defined in which a nonmonotone line search technique is employed in association with a truncated Newton algorithm. Numerical results obtained for a set of standard test problems are reported which indicate that the proposed algorithm is highly effective in the solution of illconditioned as well as of large dimensional problems.

متن کامل

Preconditioning Newton-Krylov methods in nonconvex large scale optimization

We consider an iterative preconditioning technique for large scale optimization, where the objective function is possibly non-convex. First, we refer to the solution of a generic indefinite linear system by means of a Krylov subspace method, and describe the iterative construction of the preconditioner which does not involve matrices products or matrix storage. The set of directions generated b...

متن کامل

Exploiting Negative Curvature Directions in Linesearch Methods for Unconstrained Optimization

In this paper we consider the deenition of new eecient linesearch algorithms for solving large scale unconstrained optimization problems which exploit the local nonconvexity of the objective function. Existing algorithms of this class compute, at each iteration, two search directions: a Newton-type direction which ensures a global and fast convergence, and a negative curvature direction which e...

متن کامل

A Curvilinear Method for Large Scale Optimization Problems

We present a new matrix-free method for the computation of the negative curvature direction in large scale unconstrained problems. We describe a curvilinear method which uses a combination of a quasi-Newton direction and a negative curvature direction. We propose an algorithm for the computation of the search directions which uses information of two specific L-BFGS matrices in such a way that a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008